Call-by-name, call-by-value, call-by-need and the linear lambda calculus
نویسندگان
چکیده
منابع مشابه
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus
To appear in Theoretical Computer Science, special issue on papers presented at MFPS’95. J. Maraist a, M. Odersky a, D.N. Turner b and P. Wadler c a School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, South Australia 5095, Australia. Email, fmaraist,[email protected]. b An Teallach Limited, Technology Transfer Centre, Kings Buildings, Ma...
متن کاملCall-by-Name, Call-by-Value and the lambda-Calculus
This paper examines the old question of the relationship between ISWIM and the &calculus, using the distinction between call-by-value and call-by-name. It is held that the relationship should be mediated by a standardisation theorem. :3ince this leads to difficulties, a new &calcu%~s is introduced whose standardisation theorem gives a good correspondence with ISWIM a-; given by the SECT machine...
متن کاملCall - by - name , call - by - value , call - by - need , and the linear
Girard described two translations of intuitionistic logic into linear logic, one where A ! B maps to (!A) ? B, and another where it maps to !(A ? B). We detail the action of these translations on terms, and show that the rst corresponds to a call-by-name calculus, while the second corresponds to call-by-value. We further show that if the target of the translation is taken to be an aane calculus...
متن کاملCall-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
We examine the relationship between the algebraic λ-calculus, a fragment of the differential λ-calculus and the linear-algebraic λ-calculus, a candidate λ-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalarmultiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using ...
متن کاملlambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value
Under the extension of Curry-Howard’s correspondence to classical logic, Gentzen’s NK and LK systems can be seen as syntaxdirected systems of simple types respectively for Parigot’s λμ-calculus and Curien-Herbelin’s λ̄μμ̃-calculus. We aim at showing their computational equivalence. We define translations between these calculi. We prove simulation theorems for an undirected evaluation as well as f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00358-2